Automorphisms of linear automata
نویسندگان
چکیده
منابع مشابه
Automorphisms of Transition Graphs for Linear Cellular Automata
The transition graph of a cellular automaton (CA) represents the CA’s global dynamics. The automorphisms of the transition graph are its self-isomorphisms or “symmetries”, and in a sense these are precisely the symmetries of the CA’s dynamics. Previously we have argued that studying how the total number of automorphisms varies with the number of cells on which the CA operates yields a partial c...
متن کاملLinear Automorphisms That Are Symplectomorphisms
Let K be the field of real or complex numbers. Let (X ∼=K2n , ω) be a symplectic vector space and take 0<k<n,N =( 2n 2k ). Let L1, . . . , LN ⊂X be 2k-dimensional linear subspaces which are in a sufficiently general position. It is shown that if F :X −→X is a linear automorphism which preserves the form ωk on all subspaces L1, . . . , LN , then F is an k -symplectomorphism (that is, F ∗ω= kω, w...
متن کاملAutomorphisms of Transition Graphs for Elementary Cellular Automata
The transition graph of a cellular automaton (CA) is a graphical representation of the CA’s global dynamics. Studying automorphisms of transition graphs allows us to identify symmetries in this global dynamics. We conduct a computational study of numbers of automorphisms for the elementary cellular automata (ECAs) on finite lattices. The ECAs are partitioned into three classes, depending on how...
متن کاملAutomorphisms, Non-linear Realizations and Branes
The theory of non-linear realizations is used to derive the dynamics of the branes of M theory. A crucial step in this procedure is to use the enlarged automorphism group of the supersymmetry algebra recently introduced. The field strengths of the worldvolume gauge fields arise as some of the Goldstone fields associated with this automorphism group. The relationship to the superembedding approa...
متن کاملTree Automata and Automata on Linear Orderings
We show that the inclusion problem is decidable for rational languages of words indexed by scattered countable linear orderings. The method leans on a reduction to the decidability of the monadic second order theory of the infinite binary tree [9]. Mathematics Subject Classification. 68Q45, 03D05.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computer and System Sciences
سال: 1979
ISSN: 0022-0000
DOI: 10.1016/0022-0000(79)90010-2